High-performance architecture for flow-table lookup in SDN on FPGA
نویسندگان
چکیده
منابع مشابه
High Performance Architecture for Flow-Table Lookup in SDN on FPGA
We propose Range-based Ternary Search Tree (RTST), a tree-based approach for flow-table lookup in SDN network. RTST builds upon flow-tables in SDN switches to provide a fast lookup among flows. We present a parallel multi-pipeline architecture for implementing RTST that benefits from high throughput and low latency. The proposed RTST and architecture achieve a memory efficiency of 1 byte of mem...
متن کاملMultiple Table Lookup Implementation of Error Correction on an FPGA
ASTRACT In recent studies substantial number of research papers explored possibility of accelerating CRC codes as a way of gaining significant performance increase while processing a protocol. Most software implementation depend on a speed and architectural improvements of general purpose processors. It has been reported that a single CPU core still can’t achieve 10Gbps rates when receiving and...
متن کاملFPGA Based High Performance Optical Flow Computation Using Parallel Architecture
The proposed work describes a highly parallel architecture for high performance optical flow computation. This system implements the efficient Lucas and Kanade algorithm with multi-scale extension for the computation of large motion estimations. This work deals with the architecture, evaluation of the accuracy and system performance. It also has extension to the original L&K algorithm. So the c...
متن کاملScalable FPGA/ASIC Implementation Architecture for Parallel Table-Lookup-Coding Using Multi-Ported Content Addressable Memory
This paper presents a scalable FPGA/ASIC implementation architecture for high-speed parallel table-lookup-coding using multiported content addressable memory, aiming at facilitating effective tablelookup-coding solutions. The multi-ported CAM adopts a Flexible Multiported Content Addressable Memory (FMCAM) technology, which represents an effective parallel processing architecture and was previo...
متن کاملPractical flow table aggregation in SDN
In OpenFlow-driven SDN, flow tables are TCAM-hungry; commodity switches suffer from limited concrete flow table size. One method for coping with the limitations is to use aggregation schemes to reduce the number of flow entries required to express the same forwarding semantics. Unfortunately, the aggregation of rules would retard table updates and lengthen the updating duration, during which, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2019
ISSN: 0920-8542,1573-0484
DOI: 10.1007/s11227-018-02732-2